smooth integer

“гладкое” целое число (обладает только малыми по величине простыми делителями).

English-Russian cryptological dictionary . 2014.

Смотреть что такое "smooth integer" в других словарях:

  • Smooth function — A bump function is a smooth function with compact support. In mathematical analysis, a differentiability class is a classification of functions according to the properties of their derivatives. Higher order differentiability classes correspond to …   Wikipedia

  • Smooth number — In number theory, a positive integer is called B smooth if none of its prime factors are greater than B . For example, 1,620 has prime factorization 22 × 34 × 5; therefore 1,620 is 5 smooth since none of its prime factors are greater than 5. 5… …   Wikipedia

  • Pohlig–Hellman algorithm — In mathematics, the Pohlig–Hellman algorithm is an algorithm for the computation of discrete logarithms in a multiplicative group whose order is a smooth integer. The algorithm is based on the Chinese remainder theorem.The algorithm was… …   Wikipedia

  • гладкое целое число — Обладает только малыми по величине простыми делителями. [http://www.rfcmd.ru/glossword/1.8/index.php?a=index&d=4433] Тематики защита информации EN smooth integer …   Справочник технического переводчика

  • Quadratic sieve — The quadratic sieve algorithm (QS) is a modern integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is… …   Wikipedia

  • General number field sieve — In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 100 digits. Heuristically, its complexity for factoring an integer n (consisting of log2 n bits) is of …   Wikipedia

  • Størmer's theorem — In number theory, Størmer s theorem, named after Carl Størmer, gives a finite bound on the number of consecutive pairs of smooth numbers that exist, for a given degree of smoothness, and provides a method for finding all such pairs using Pell… …   Wikipedia

  • Dirac delta function — Schematic representation of the Dirac delta function by a line surmounted by an arrow. The height of the arrow is usually used to specify the value of any multiplicative constant, which will give the area under the function. The other convention… …   Wikipedia

  • Dixon's factorization method — In number theory, Dixon s factorization method (also Dixon s random squares method[1] or Dixon s algorithm) is a general purpose integer factorization algorithm; it is the prototypical factor base method, and the only factor base method for which …   Wikipedia

  • Atiyah–Singer index theorem — In the mathematics of manifolds and differential operators, the Atiyah–Singer index theorem states that for an elliptic differential operator on a compact manifold, the analytical index (closely related to the dimension of the space of solutions) …   Wikipedia

  • Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

Книги

Другие книги по запросу «smooth integer» >>

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.